Languages and Computation (G52LAC) Lecture notes Spring 2017
نویسندگان
چکیده
3 Finite Automata 11 3.1 Deterministic finite automata . . . . . . . . . . . . . . . . . . . . 11 3.1.1 What is a DFA? . . . . . . . . . . . . . . . . . . . . . . . 11 3.1.2 The language of a DFA . . . . . . . . . . . . . . . . . . . 13 3.2 Nondeterministic finite automata . . . . . . . . . . . . . . . . . . 14 3.2.1 What is an NFA? . . . . . . . . . . . . . . . . . . . . . . . 14 3.2.2 The language accepted by an NFA . . . . . . . . . . . . . 16 3.2.3 The subset construction . . . . . . . . . . . . . . . . . . . 19 3.2.4 Correctness of the subset construction . . . . . . . . . . . 23
منابع مشابه
CS4232 – Theory of Computation
These lecture notes contain all material relevant for the examinations and the course. For further reading, the author refers to the textbooks Automata Theory and its Applications by Bakhadyr Khoussainov and Anil Nerode [46] and Introduction to Automata Theory, Languages, and Computation by Hopcroft, Motwani and Ullman [35]. The author would like to thank Volker Diekert, Henning Fernau, Vladimi...
متن کاملMath 538: Algebraic Number Theory Lecture Notes
These are rough notes for the Spring 2013 course. Problem sets and solutions were posted on an internal website.
متن کاملGeneralised entropies and asymptotic complexities of languages
• conference version: Y. Kalnishkan, V. Vovk and M. V. Vyugin. Generalised Entropy and Asymptotic Complexities of Languages. In Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, volume 4539 of Lecture Notes in Computer Science, pages 293-307, Springer 2007. — limited to two games — inaccuracies in the main result • full version accepted for publication in Information and Co...
متن کاملLecture Notes on Futures 15-312: Foundations of Programming Languages
In this lecture we first examine a technique to specify the operational semantics for lazy evaluation. This is an implementation technique for a call-by-name semantics that avoids re-evaluating expressions multiple times by memoizing the result of the first evaluation. Then we use a similar technique to specify the meaning of futures, a construct that introduces parallelism into evaluation. Fut...
متن کامل